IEEE Transactions on Information Theory

Ieee Transactions on Information Theory

A class of codes, having check matrices which are the tensor products of the check matrices of nonbinary and binary codes has been described. In particular, it has been shown in detail how the error-correction, error-detection and error-location capabilities of such codes depend on the component codes. Many other variations of such codes exist in addition to those discussed in this paper. In so...

Ieee Transactions on Information Theory

Information Distance - Information Theory, IEEE Transactions on

While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal information metric, based on length of shortest programs for either ordinary computations or reversible ...

Universal Prediction - Information Theory, IEEE Transactions on

This paper consists of an overview on universal prediction from an information-theoretic perspective. Special attention is given to the notion of probability assignment under the self-information loss function, which is directly related to the theory of universal data compression. Both the probabilistic setting and the deterministic setting of the universal prediction problem are described with...

Quantization - Information Theory, IEEE Transactions on

The history of the theory and practice of quantization dates to 1948, although similar ideas had appeared in the literature as long ago as 1898. The fundamental role of quantization in modulation and analog-to-digital conversion was first recognized during the early development of pulsecode modulation systems, especially in the 1948 paper of Oliver, Pierce, and Shannon. Also in 1948, Bennett pu...